منابع مشابه
Approximate Proximity Drawings
We introduce and study a generalization of the well-known region of influence proximity drawings, called (ε1, ε2)-proximity drawings. Intuitively, given a definition of proximity and two real numbers ε1 ≥ 0 and ε2 ≥ 0, an (ε1, ε2)-proximity drawing of a graph is a planar straight-line drawing Γ such that: (i) for every pair of adjacent vertices u, v, their proximity region “shrunk” by the multi...
متن کاملProximity Drawings of Outerplanar Graphs
A proximity drawing of a graph is one in which pairs of adjacent vertices are relatively close together according to some proximity measure, while pairs of non-adjacent vertices are relatively far apart. It is the choice of the proximity measure that determines the type of proximity drawing. Although proximity drawings have many uses, the study of their combinatorial properties is still in its ...
متن کاملProximity Drawings of Outerplanar Graphs ( Preliminary
A proximity drawing of a graph is one in which pairs of adjacent vertices are drawn relatively close together according to some proximity measure while pairs of non-adjacent vertices are drawn relatively far apart. The fundamental question concerning proximity drawability is: Given a graph G and a deenition of proximity, is it possible to construct a proximity drawing of G? We consider this que...
متن کاملProximity drawings in polynomial area and volume
We introduce a novel technique for drawing proximity graphs in polynomial area and volume. Previously known algorithms produce representations whose size increases exponentially with the size of the graph. This holds even when we restrict ourselves to binary trees. Our method is quite general and yields the first algorithms to construct (a) polynomial area weak Gabriel drawings of ternary trees...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2013
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2013.01.001